Hardware Implementation of Single Iterated Multiplicative Inverse Square Root
نویسندگان
چکیده
منابع مشابه
An Optimized Square Root Algorithm for Implementation in Fpga Hardware
This paper presents an optimized digit-by-digit calculation method to solve complicated square root calculation in hardware, as a proposed simple algorithm for implementation in field programmable gate array (FPGA). The main principle of proposed method is two-bit shifting and subtracting-multiplexing operations, in order to achieve a simpler implementation and faster calculation. The proposed ...
متن کاملImplementation of single precision floating point square root on FPGAs
Square root operation is hard to implement on FPGAs because of the complexity of the algorithms. In this paper, we present a non-restoring square root algorithm and two very simple single precision floating point square root implementations based on the algorithm on FPGAs. One is low-cost iterative implementation that uses a traditional adder/subtractor. The operation latency is 25 clock cycles...
متن کاملImplementation of Integer Square Root
Square root plays a major role in applications like computer graphics, image processing. To increase the performance of computation, many algorithms have been proposed to carry out the computation task in hardware instead of software. One very common and relatively quick method for finding the square root of a number is the Newton-Raphson method which requires extensive use of division to produ...
متن کاملImplementation of Different Square Root Algorithms
This paper presents the operation and the implementation of novel fixed point square root algorithms with an input range of 0 to 1 into CMOS. These algorithms are referred to as non-restoring and restoring algorithm and were compared with a square root implementation into a lookup table (LUT). The power consumption, the area consumption and the propagation delay were investigated and the result...
متن کاملHigh-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Elektronika ir Elektrotechnika
سال: 2017
ISSN: 2029-5731,1392-1215
DOI: 10.5755/j01.eie.23.4.18717